package leetcode.editor.cn;

/**
 * @author: yangwk
 * @date: 2023/8/3
 * @description:
 **/
public class P474 {
    public static void main(String[] args) {
        String[] strs = {"10", "0001", "111001", "1", "0"};
        int m = 5, n = 3;
        System.out.println(findMaxForm(strs, m, n));
    }
    public static int findMaxForm(String[] strs, int m, int n) {
        //'0'
        char zero = '0', one = '1';
        int[][] arr1 = new int[strs.length][2];
        int[][] arr2 = new int[strs.length][2];
        for (int i = 0; i < strs.length; i++) {
            String str = strs[i];
            int zeroNum = count(str, zero);
            int oneNum = count(str, one);
        }
        return 0;
    }
    public static int count(String str,char ch){
        int count = 0;
        for (int i = 0; i < str.length(); i++) {
            if (ch == str.charAt(i)) {
                count++;
            }
        }
        return count;
    }
}
